Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
نویسندگان
چکیده
We consider constraint satisfaction problems parameterized by the set of allowed constraint predicates. We examine the complexity of quantified constraint satisfaction problems with a bounded number of quantifier alternations and the complexity of the associated counting problems. We obtain classification results that completely solve the Boolean case, and we show that hardness results carry over to the case of arbitrary finite domains.
منابع مشابه
Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a simple criterion to determine which of the two cases holds. This result is surprising in light of Ladner’s theorem, which implies that there are an infinite...
متن کاملCSP Properties for Quantified Constraints: Definitions and Complexity
Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the simple, classical notion of solution inappropriate. As a consequence, even such essential CSP properties as consistency or substitutability are not completely understood in the quantified case. In this paper, we show that mo...
متن کاملCounting as Method , Model and Task in Theoretical Computer Science
family of languages, 59AC, 80AC, 21ACC, 80advice, 17, 26AFL, 59alternation, 19automatonfinite, 83Auxiliary Pushdown Automaton, 18AuxPDA, 18 BDD, 53Binary Decision Diagrams, 53BLIND, 64bounded, 70bounded fan-in, 21Branching Programs, 53 carrier set, 119ccc, 73cdc, 74certificate, 31CFLth, 64, 67characteristic function...
متن کاملInductive Counting below LOGSPACE
We apply the inductive counting technique to nondetermin-istic branching programs and prove that complementation on this model can be done without increasing the width of the branching programs too much. This shows that for an arbitrary space bound s(n), the class of languages accepted by nonuniform nondeterministic O(s(n)) space bounded Turing machines is closed under complementation. As a con...
متن کاملCounting Constraints in Flat Array Fragments
We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality constraints for interpreted sets, which is amenable to automated analysis. We establish decidability and complexity results for such a fragment and we implement our algorithms. The experiments run in discharging proof obligations coming from invariant checking and bounded model-checking benchmark...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2005